An Information-Theoretical Analysis of the Minimum Cost to Erase Information

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Information-Theoretical Analysis of the Minimum Cost to Erase Information

We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite the sequence of information with a sequence of symbols independent of the information. The overwriting is needed only at places where overwritten symbols are different from original symbols. Then, the cost of overwrite...

متن کامل

Content of information ethics in the Holy Quran: an analysis

Background and Objectives: Information ethics, according to Islam, equals observing human rights and morals in dealing with information transmission and provision, which must be based on honesty and truthfulness. As Islam highly values society and social issues, it believes that human behaviors and interactions are strongly interconnected in a society. Committing to ethical issues regarding inf...

متن کامل

The Effects of Information System Integration on Financial Performance Mediated by Cost Performance and Quality Performance: An SEM-based Analysis

This study investigated the effects of information system (IS) integration on financial performance in Tehran Stock Exchange with an emphasis on the mediating role of cost performance and quality performance. This survey was carried out in 2018 by distributing 300 questionnaires among all CEOs, financial administrative vice-presidents, accounting managers, and accountants of manufacturing compa...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2018

ISSN: 0916-8508,1745-1337

DOI: 10.1587/transfun.e101.a.2099